Graph-theoretic Arguments in Circuit Complexity
نویسنده
چکیده
منابع مشابه
On Graph Complexity
A circuit complexity of a graph is the minimum number of union and intersection operations needed to obtain the whole set of its edges starting from stars. Our main motivation to study this measure of graphs is that it is related to the circuit complexity of boolean functions. We prove some lower bounds to the circuit complexity of explicitly given graphs. In particular, we use the graph theore...
متن کاملComplexity of Linear Boolean Operators Complexity of Linear Boolean Operators
How to compute a linear Boolean operator by a small circuit using only unbounded fanin addition gates? Because this question is about one of the simplest and most basic circuit models, it has been considered by many authors since the early 1950s. This has led to a variety of upper and lower bound arguments—ranging from algebraic (determinant and matrix rigidity), to combinatorial (Ramsey proper...
متن کاملComplexity and Combinatorial Properties of Argument Systems
Argument Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. In this note we consider combinatorial and complexity-theoretic issues arising from the view of argument systems as directed graphs. The complexity results focus on decision questions pertaining to different degrees ...
متن کاملComplexity of Linear Boolean Operators
How to compute a linear Boolean operator by a small circuit using only unbounded fanin addition gates? Because this question is about one of the simplest and most basic circuit models, it has been considered by many authors since the early 1950s. This has led to a variety of upper and lower bound arguments—ranging from algebraic (determinant and matrix rigidity), to combinatorial (Ramsey proper...
متن کاملExact annihilating-ideal graph of commutative rings
The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017